The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
نویسندگان
چکیده
We deene the subvariance S P (F) of a family of graphs F with respect to property P to be the innmum of the ratio jH1j jH2j , where H 1 and H 2 are any two maximal spanning subgraphs of G with property P, and where G is a member of F. It is shown that, for the family of all connected graphs, the subvariance when P is planar, outerplanar, and bipartite planar, is 1=3, 1=2, and 1=2, respectively.
منابع مشابه
Bipartite minors
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem: a bipartite graph is planar if and only if it does not contain K3,3 as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite (2, 2)-Laman graphs — a certain family of graphs that contains...
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملMaximal Planar Subgraphs of Fixed Girth in Random Graphs
In 1991, Bollobás and Frieze showed that the threshold for Gn,p to contain a spanning maximal planar subgraph is very close to p = n−1/3. In this paper, we compute similar threshold ranges for Gn,p to contain a maximal bipartite planar subgraph and for Gn,p to contain a maximal planar subgraph of fixed girth g.
متن کاملLarge Induced Outerplanar and Acyclic Subgraphs of Planar Graphs
Albertson and Berman [1] conjectured that every planar graph has an induced forest on half of its vertices; the current best result, due to Borodin [3], is an induced forest on two fifths of the vertices. We show that the Albertson-Berman conjecture holds, and is tight, for planar graphs of treewidth 3 (and, in fact, for any graph of treewidth at most 3). We also improve on Borodin’s bound for ...
متن کاملAnalogues of cliques for oriented coloring
We examine subgraphs of oriented graphs in the context of oriented coloring that are analogous to cliques in traditional vertex coloring. Bounds on the sizes of these subgraphs are given for planar, outerplanar, and series-parallel graphs. In particular, the main result of the paper is that a planar graph cannot contain an induced subgraph D with more than 36 vertices such that each pair of ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 149 شماره
صفحات -
تاریخ انتشار 1996